Coherence of subsumption for monadic types
نویسنده
چکیده
One approach to give semantics to languages with subtypes is by translation to target languages without subtyping: subtypings A B are interpreted via conversion functions A→B. This paper shows how to extend the method to languages with computational effects, using Moggi’s computational metalanguage.
منابع مشابه
Predications, Fast and Slow
Notions of predication based on extensional and intensional subsumption, as described by Woods, are related to Kahneman’s systems of thinking fast and slow. Path-based reasoning with links is applied to predication over not only individuals but (following Carlson) kinds and stages/time. Predications, fast and slow, are formulated in monadic secondorder logic over strings, analyzed in Goguen and...
متن کاملUsing Subsumption in Semantic Query Optimization
Semantic Query Optimization optimize query processing by transforming a query into a semantically equivalent one, i.e. a query whose result is the same for every instance of the database. Semantic query optimization can be obtained by a query rewriting that takes into account the integrity constraints the database must satisfy. In this paper we analyze the possibility of implementing semantic o...
متن کاملSubsumption for XML types
XML data is often used validated stored queried etc with respect to di erent types Understanding the relationship between these types can provide important information for manipulating this data We propose a notion of subsumption for XML to capture such relation ships Subsumption relies on a syntactic mapping between types and can be used for facilitating validation and query processing We stud...
متن کاملUse of Cohesive Ties in English as a Foreign Language Students’ Writing
This study aims to understand certain linguistic and semantic resources for the text construction, namely the constructs of cohesion, coherence. The analysis of cohesive ties was conducted on the writing samples of 40 subjects (20 most coherent and 20 least coherent) Iranian undergraduates of English. This prompted us to identify the dominant types of cohesive devices used in most coherent writ...
متن کاملEvaluation à la Carte - Non-Strict Evaluation via Compositional Data Types
We describe how to perform monadic computations over recursive data structures with fine grained control over the evaluation strategy. This solves the issue that the definition of a recursive monadic function already determines the evaluation strategy due to the necessary sequencing of the monadic operations. We show that compositional data types already provide the structure needed in order to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Funct. Program.
دوره 19 شماره
صفحات -
تاریخ انتشار 2009